Relevance via decomposition

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypertree-decomposition via Branch-decomposition

Hypertree-decomposition is the most general approach in the literature for identifying tractable computation problems encoded as hypergraphs. We show how the heuristic branch-decomposition approach for ordinary graphs of [Cook and Seymour, 2003] can be used for the heuristic construction of hypertree-decompositions.

متن کامل

Tensor Decomposition via Joint Matrix Schur Decomposition

We describe an approach to tensor decomposition that involves extracting a set of observable matrices from the tensor and applying an approximate joint Schur decomposition on those matrices, and we establish the corresponding firstorder perturbation bounds. We develop a novel iterative Gauss-Newton algorithm for joint matrix Schur decomposition, which minimizes a nonconvex objective over the ma...

متن کامل

Facile synthesis of Ni/NiO nanocomposites via thermal decomposition

In this study, Ni/NiO nanocomposites were prepared using simple, environment-friendly and low-cost solid-state thermal decomposition method from nickel (II) Schiff base complex at 400 and 500°C for 3 hours. The Ni/NiO nanocomposites were characterized with Fourier transformed infra-red spectroscopy (FT-IR), X-ray powder diffraction (XRD), transmission electron microscopy (TEM) and X-Ray fluores...

متن کامل

Task-Decomposition via Plan

Task-decomposition planners make use of schemata that define tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called taslc reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan pursing approach...

متن کامل

Denoising via Empirical Mode Decomposition

In this paper a signal denoising scheme based a multiresolution approach referred to as Empirical mode decomposition (EMD) [1] is presented. The denoising method is a fully data driven approach. Noisy signal is decomposed adaptively into intrinsic oscillatory components called Intrinsic mode functions (IMFs) using a decomposition algorithm algorithm called sifting process. The basic principle o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Australasian Journal of Logic

سال: 2017

ISSN: 1448-5052

DOI: 10.26686/ajl.v14i3.4009